By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 36, Issue 1, pp. 1-280

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Scheduling Split Intervals

R. Bar-Yehuda, M. M. Halldórsson, J. (S.) Naor, H. Shachnai, and I. Shapira

pp. 1-15

A Simple Algorithm for Mal'tsev Constraints

Andrei Bulatov and Víctor Dalmau

pp. 16-27

Identifying Clusters from Positive Data

John Case, Sanjay Jain, Eric Martin, Arun Sharma, and Frank Stephan

pp. 28-55

Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots

Noa Agmon and David Peleg

pp. 56-82

Disproving the Single Level Conjecture

Stasys Jukna

pp. 83-98

Reconstructing Chromosomal Evolution

Li-San Wang and Tandy Warnow

pp. 99-131

Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication

Petros Drineas, Ravi Kannan, and Michael W. Mahoney

pp. 132-157

Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

Petros Drineas, Ravi Kannan, and Michael W. Mahoney

pp. 158-183

Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition

Petros Drineas, Ravi Kannan, and Michael W. Mahoney

pp. 184-206

A Complete Classification of the Complexity of Propositional Abduction

Nadia Creignou and Bruno Zanuttini

pp. 207-229

Full Constraint Satisfaction Problems

Tomás Feder and Pavol Hell

pp. 230-246

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows

Mary Cryan, Martin Dyer, Leslie Ann Goldberg, Mark Jerrum, and Russell Martin

pp. 247-278

Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

Ichiro Suzuki and Masafumi Yamashita

pp. 279-280